Thesis Abstract: Path-planning for Industrial Robots Among Multiple Under-specified Tasks
نویسندگان
چکیده
Nowadays industrialized countries with their high labor costs have to rely on production automation to keep their competitive advantage. One of the most flexible and powerful automation technology available today is industrial robotics. Equipped with the right tool, standardized industrial robots can perform numerous production tasks. Since acquisition and programming of an industrial robot are very expensive, the feasibility of using robots in production facilities depends on the efficiency with which the robot can perform its task: the more production steps a robot can perform in a given time interval, the higher the production rates, as a consequence the faster the robot can compensate for its initial acquisition and programming costs, and the higher is the competitive advantage it provides to the company. Virtually all robotics scenarios consist of two different types of robotic movements. The first category includes movements that are specifically required for the job. For example welding a seam, deburring some sharp edge or cutting a shape. These movements are typically the movements, during which the tools (e.g., a welding torch) are switched on. We call this category effective movements or effective tasks. In between two effective movements are supporting movements. Supporting movements are not directly needed for a given job. However, they are necessary to sequence one effective movement after the other. In the example of seam welding, these movements would be to move the robot from welding seam to welding seam. We call these movements supporting movements or supporting tasks. Fig. 1 illustrates this concept on a simple welding example. The two welding seams – (2) and (4) – are effective movements, while (1), (3) and (5) are supporting movements, which are only necessary to execute the effective movements. The major characteristics that affect the efficiency of a given robot are how fast the robot can perform its tasks (effective movements), and how long it takes the robot to move into position to perform a task after having completed the previous one (support movements). While effective movements are usually understood as rigid paths (defined by the task/application), supporting movements are open to computational optimization.
منابع مشابه
Formation Control and Path Planning of Two Robots for Tracking a Moving Target
This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...
متن کاملPath Planning with Kinematic Constraints for Robot Groups
Narrow Corridor 8 iRobot Create2 100 Agents Abstract: Path planning for multiple robots is well studied in the AI and robotics communities. For a given discretized environment, robots need to find collision-free paths to a set of specified goal locations. Robots can be fully anonymous, non-anonymous, or organized in groups. Although powerful solvers for this abstract problem exist, they make si...
متن کاملSubdimensional Expansion: A Framework for Computationally Tractable Multirobot Path Planning
Planning optimal paths for large numbers of robots is computationally expensive. In this thesis, we present a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded in...
متن کاملDesigning Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملComparing the efficiency of five algorithms applied to path planning for industrial robots
PurposeTo compare the quality and efficiency of five methods for solving the path planning problem of industrial robots in complex environments Design/methodology/approachFive methods are presented for solving the path planning problem and certain working parameters have been monitored using each method. These working parameters are the distance travelled by the robot and the computational time...
متن کامل